Перевод: с английского на все языки

со всех языков на английский

transition semigroup

См. также в других словарях:

  • Semigroup action — In algebra and theoretical computer science, an action or act of a semigroup on a set is a rule which associates to each element of the semigroup a transformation of the set in such a way that the product of two elements of the semigroup (using… …   Wikipedia

  • Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and …   Wikipedia

  • Borel right process — Let E be a locally compact separable metric space.We will denote by mathcal E the Borel subsets of E.Let Omega be the space of right continuous maps from [0,infty) to E that have left limits in E,and for each t in [0,infty), denote by X t the… …   Wikipedia

  • Semiautomaton — In mathematics and theoretical computer science, a semiautomaton is an automaton having only an input, and no output. It consists of a set Q of states, a set Σ called the input alphabet, and a function T: Q × Σ → Q called the transition function …   Wikipedia

  • Quantum decoherence — Quantum mechanics Uncertainty principle …   Wikipedia

  • Monoid — This article is about the mathematical concept. For the alien creatures in the Doctor Who adventure, see The Ark (Doctor Who). Coherence law for monoid unit In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a… …   Wikipedia

  • Feller process — In mathematics, a Feller process is a particular kind of Markov process.DefinitionsLet X be a locally compact topological space with a countable base. Let C 0( X ) denote the space of all real valued continuous functions on X which vanish at… …   Wikipedia

  • Ring (mathematics) — This article is about algebraic structures. For geometric rings, see Annulus (mathematics). For the set theory concept, see Ring of sets. Polynomials, represented here by curves, form a ring under addition and multiplication. In mathematics, a… …   Wikipedia

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… …   Wikipedia

  • Renormalization group — In theoretical physics, the renormalization group (RG) refers to a mathematical apparatus that allows systematic investigation of the changes of a physical system as viewed at different distance scales. In particle physics, it reflects the… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»